Default reasoning from conditional knowledge bases: Complexity and tractable cases
نویسندگان
چکیده
منابع مشابه
Default reasoning from conditional knowledge bases: Complexity and tractable cases
Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form “ ! ”, which informally read as “generally, if then .” Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties ...
متن کاملNew Tractable Cases in Default Reasoning from Conditional Knowledge Bases
We present new tractable cases for default reasoning from conditional knowledge bases. In detail, we introduce q-Horn conditional knowledge bases, which allow for a limited use of disjunction. We show that previous tractability results for "-entailment, proper "-entailment, and zand z+-entailment in the Horn case can be extended to the q-Horn case. Moreover, we present feedback-freeHorn conditi...
متن کاملComplexity Results for Default Reasoning from Conditional Knowledge Bases
Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form “ ! ”, which informally read as “generally, if then .” Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties ...
متن کاملComplexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases
This paper presents new complexity results for propositional closed world reasoning (CWR) from tractable knowledge bases (KBs). Both (basic) CWR, generalized CWR, extended generalized CWR, careful CWR and extended CWR (equivalent to circumscription) are considered. The focus is laid on tractable KBs belonging to target classes for exact compilation functions: Blake formulas, DNFs, disjunctions ...
متن کاملTractable Reasoning in First-Order Knowledge Bases with Disjunctive Information
This work proposes a new methodology for establishing the tractability of a reasoning service that deals with expressive first-order knowledge bases. It consists of defining a logic that is weaker than classical logic and that has two properties: first, the entailment problem can be reduced to the model checking problem for a small number of characteristic models; and second, the model checking...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2000
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(00)00073-4